Groups With Two Generators Having Unsolvable Word Problem And Presentations of Mihailova Subgroups
نویسندگان
چکیده
A presentation of a group with two generators having unsolvable word problem and an explicit countable presentation of Mihailova subgroup of F2 × F2 with finite number of generators are given. Where Mihailova subgroup of F2 × F2 enjoys the unsolvable subgroup membership problem. One then can use the presentation to create entities’ private keys in a public key cryptsystem.
منابع مشابه
Generic Subsets Of
In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary word hyperbolic group is very likely to be a set of free generators for a nicely embedded free subgroup. We also exhibit some finitely presented amenable gr...
متن کاملThe Word Problem in Groups of Cohomological
We show that the finitely presented groups with unsolvable word problem given by the Boone-Britton construction have cohomological dimension 2. More precisely we show these groups can be obtained from a free group by successively forming HNN-extensions where the associated subgroups are finitely generated free groups. Also the presentations obtained for these groups are aspherical. Using this w...
متن کاملFibre Products, Non-positive Curvature, and Decision Problems
We give a criterion for fibre products to be finitely presented and use it as the basis of a construction that encodes the pathologies of finite group presentations into pairs of groups P ⊂ G where G is a product of hyperbolic groups and P is a finitely presented subgroup. This enables us to prove that there is a finitely presented subgroup P in a biautomatic group G such that the generalized w...
متن کاملDouble shielded Public Key Cryptosystems
By introducing extra shields on Shpilrain and Ushakov’s Ko-Lee-like protocol based on the decomposition problem of group elements we propose two new key exchange schemes and then a number of public key cryptographic protocols. We show that these protocols are free of known attacks. Particularly, if the entities taking part in our protocols create their private keys composed by the generators of...
متن کاملIntersection problem for Droms RAAGs
We solve the subgroup intersection problem (SIP) for any RAAG G of Droms type (i.e., with defining graph not containing induced squares or paths of length 3): there is an algorithm which, given finite sets of generators for two subgroups H,K 6 G, decides whether H ∩ K is finitely generated or not, and, in the affirmative case, it computes a set of generators for H ∩ K. Taking advantage of the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014